Relational Grammars for Knowledge Representation
نویسنده
چکیده
This paper aims to enhance the practical applicability of relational grammars, which have been devised for the semantic analysis of natural language. We focus on their application in knowledge representation. In particular, we address how the representation problem for kl-one-based knowledge representation systems can be automatically solved with the help of relational grammars. New rules are presented for natural language formulations, like has sons and has at least two sons, commonly arising in application domains. For accommodating the latter kind of sentences we introduce a new class of so-called (concrete) graded Peirce algebras. A graded Peirce algebra is a Peirce algebra endowed with a countable set of numerical quantiier operations.
منابع مشابه
Organization of Gatekeeping and Mental Framework in the System of Representation and Hierarchical Relational Structures of the Modern Society
Critical discourse analysis as a type of social practice reveals how linguistic choices enable speakers to manipulate the realizations of agency and power in the representation of action.The present study examines the relationship between language and ideology and explores how such a relationship is represented in the analysis of spoken text and to show how declarative knowledge, beliefs, attit...
متن کاملXML to Relational Conversion Using Theory of Regular Tree Grammars
In this paper, we study the different steps of translation from XML to relational models, while maintaining semantic constraints. Our work is based on the theory of regular tree grammars, which provides a useful formal framework for understanding various aspects of XML schema languages. We first study two normal form representations for regular tree grammars. The first normal form representatio...
متن کاملRelational Grammars: Theory and Practice in a Visual Language Interface for Process Modeling
Relational Grammars (RGs) are one of the higher-dimensional grammar formalisms that have been proposed for representing visual languages (VLs). This paper serves as an overview of the formalism as well as a case study of its application in a visual language interface (VLI) for process modeling. Relational Grammars are a member of the context-free family of Constraint Multiset Grammars (Marriott...
متن کاملLexicalized Well-Founded Grammars: Learnability and Merging
This paper presents the theoretical foundation of a new type of constraint-based grammars, Lexicalized Well-Founded Grammars, which are adequate for modeling human language and are learnable. These features make the grammars suitable for developing robust and scalable natural language understanding systems. Our grammars capture both syntax and semantics and have two types of constraints at the ...
متن کاملA Grammar-based Approach to Design and its Application to Electronics and Logic Programming
The paper describes how formal grammars can be used for knowledge representation in electronic design and how logic programming techniques can be applied for grammar representation and manipulation. The basic idea is that formal grammars can be used to explicitly represent design knowledge and design concepts usually not represented or accessible by design tools and that such design knowledge c...
متن کامل